Solving the unit commitment problem of hydropower plants via Lagrangian Relaxation and Sequential Quadratic Programming
نویسندگان
چکیده
منابع مشابه
Solving the unit commitment problem of hydropower plants via Lagrangian Relaxation and Sequential Quadratic Programming
We consider the optimal scheduling of hydropower plants in a hydrothermal interconnected system. This problem, of outmost importance for large-scale power systems with a high proportion of hydraulic generation, requires a detailed description of the so-called hydro unit production function. In our model, we relate the amount of generated hydropower to nonlinear tailrace levels; we also take int...
متن کاملSolving the Hydrothermal Unit Commitment Problem via Lagrangian Relaxation and Augmented Lagrangian
This paper considers the hydrothermal unit commitment problem of power systems with high proportion of hydraulic generation. In this sense, a large-scale mixed-integer nonlinear programming problem for the two day cost-optimal generation of system is developed. The model involves a large number of mixed-integer decision variables and constraints linking time periods and operation units. A Lagra...
متن کاملLagrangian Relaxation Neural Network for Unit Commitment
This paper presents a novel method for unit commitment by synergistically combining Lagrangian relaxation for constraint handling with Hopfield-type recurrent neural networks for fast convergence to the minimum. The key idea is to set up a Hopfieldtype network using the negative dual as its energy function. This network is connected to “neuron-based dynamic programming modules” that make full u...
متن کاملConic Relaxation of the Unit Commitment Problem
The unit commitment (UC) problem aims to find an optimal schedule of generating units subject to demand and operating constraints for an electricity grid. The majority of existing algorithms for the UC problem rely on solving a series of convex relaxations by means of branch-and-bound and cuttingplanning methods. The objective of this paper is to obtain a convex model of polynomial size for pra...
متن کاملPartial Lagrangian relaxation for general quadratic programming
We give a complete characterization of constant quadratic functions over an affine variety. This result is used to convexify the objective function of a general quadratic programming problem (Pb) which contains linear equality constraints. Thanks to this convexification, we show that one can express as a semidefinite program the dual of the partial Lagrangian relaxation of (Pb) where the linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational & Applied Mathematics
سال: 2005
ISSN: 0101-8205
DOI: 10.1590/s0101-82052005000300001